Fast Winning Strategies for the Maker-Breaker Domination Game
نویسندگان
چکیده
منابع مشابه
Fast winning strategies in Maker-Breaker games
We consider unbiased Maker-Breaker games played on the edge set of the complete graph Kn on n vertices. Quite a few such games were researched in the literature and are known to be Maker’s win. Here we are interested in estimating the minimum number of moves needed for Maker in order to win these games. We prove the following results, for sufficiently large n: (1) Maker can construct a Hamilton...
متن کاملWinning fast in fair biased Maker-Breaker games
We study the (a : a) Maker-Breaker games played on the edge set of the complete graph on n vertices. In the following four games – perfect matching game, Hamiltonicity game, star factor game and path factor game, our goal is to determine the least number of moves which Maker needs in order to win these games. Moreover, for all games except for the star factor game, we show how Red can win in th...
متن کاملEfficient Winning Strategies in Random-Turn Maker-Breaker Games
We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007. A p-random-turn positional game is a two-player game, played the same as an ordinary positional game, except that instead of alternating turns, a coin is being tossed before each turn to decide the identity of the next player to move (the probability of Player I to move is p). We analyze the ra...
متن کاملFast Strategies In Maker-Breaker Games Played on Random Boards
In this paper we analyze classical Maker-Breaker games played on the edge set of a sparse random board G ∼ Gn,p. We consider the Hamiltonicity game, the perfect matching game and the k-connectivity game. We prove that for p(n) ≥ polylog(n)/n, the board G ∼ Gn,p is typically such that Maker can win these games asymptotically as fast as possible, i.e. within n+ o(n), n/2 + o(n) and kn/2 + o(n) mo...
متن کاملDoubly Biased Maker-Breaker Connectivity Game
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.042